Traffic Network Equilibrium Problems with Capacity Constraints of Arcs and Linear Scalarization Methods
نویسندگان
چکیده
Traffic network equilibrium problems with capacity constraints of arcs are studied. A weak vector equilibrium principle with vector-valued cost functions, which are different from the ones in the work of Lin 2010 , and three kinds of parametric equilibrium flows are introduced. Some necessary and sufficient conditions for a weak vector equilibrium flow to be a parametric equilibrium flow are derived. Relationships between a parametric equilibrium flow and a solution of a scalar variational inequality problem are also discussed. Some examples are given to illustrate our results.
منابع مشابه
Essential Components of the Solution Set for Multiclass Multicriteria Traffic Equilibrium Problems
Wardrop [1] introduced the famous user equilibrium principle for traffic network, which is a scalar equilibrium principle. Smith [2] investigated that a Wardrop's user equilibrium flow is equivalent to the solution of a class of variational inequalities when the travel cost function is a scalar function. Recently, many researchers have proposed equilibrium models based on multicriteria consider...
متن کاملAn Algorithm for Traffic Equilibrium Flow with Capacity Constraints of Arcs
In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equili...
متن کاملOptimal Allocation of Electric Vehicles' Parking Lots in Distribution System Considering Urban Traffic
Abstract: Parking lots for electric vehicles (EVs) can make good utilization of the EVschr('39') battery capacity due to the large number of EVs. However, the location and size of parking lots will affect the distribution network condition. In this paper, a mixed-integer linear programming (MILP) model is proposed for locating and determining the optimal capacity of EVschr('39') parking lots co...
متن کاملInterdependent Security Game Design over Constrained Linear Influence Networks
In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012